t-Particle Random Walks and Recycling Random Bits in Parallel

We show that r pseudo-random bits can be obtained by concatenating t blocks of r=t pseudo-random bits, where the blocks are generated in parallel. This can be considered as a parallel version of 8] { recycling random bits by doing a random walk on an expander. The proof is based on the fact that t simultaneous independent random walks on an expander graph is equivalent to a random walk on a much larger expander. In 8] generating the random walk requires arithmetical operations with long integers. In the parallel version the integers involved are much shorter, and diierent segments of the pseudo-random bits are generated independently in parallel. Optimal speedup is also achieved.